Method for reliable classification of samples in clinical diagnostics using an improved method of classification

ABSTRACT

A system for classification of a test object using a training set comprising a plurality of objects, each of which is assigned as a member of a class. Collectively, the objects in the training set are members of at least two classes. A computer system is configured as a probabilistic classifier. The classifier estimates the probability of the test object being a member of each of the classes in the training set. The probabilistic classifier estimates the probability with reference to the class assignments of the objects in the training set which are neighbors to the test object within a defined region within the training set. The probabilistic classifier takes into account the situation in which there is an imbalance in the number of objects in the different classes in the training set. Additionally, the probabilistic classifier does not require any knowledge of the probability distribution function of the classes in the training set.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority benefits under 35 U.S.C. §119 to U.S.provisional application Ser. No. 60/959,990 filed Jul. 18, 2007.

This application also claims priority benefit under 35 U.S.C. §120 as acontinuation-in-part of U.S. patent application Ser. No. 11/396,328filed Mar. 31, 2006, published as U.S. Patent Application publication2007/0231921, pending.

The entire content of the Ser. No. 60/959,990 filed Jul. 18, 2007 andSer. No. 11/396,328 filed Mar. 31, 2006 is incorporated by referenceherein.

BACKGROUND

This disclosure is related to the field of methods and systems whichperform classification of an object, such as a data set associated witha test sample. Here and in the following, the term “classification” isused in the sense of supervised classification, i.e. classificationbased on a training set of previously labeled objects. Moreparticularly, the disclosure is directed to a method for determining theprobability that a test object is a member of a particular class, givena training set of previously labeled objects. The methods have manypossible applications, including medical-related fields. For example,the classification methods can be used for predicting whether a patientwill derive benefit or adverse effects from the administration of aparticular drug.

The present disclosure discusses one possible application of theinvention in which a test object to be classified is in the form of amass spectrum containing a peak, or a group of peaks, with respect to atraining set comprising a set of mass spectra that are members of two ormore classes. However, the methods can be used with other types of data.Hence, in the following disclosure, the term “test instance” isoccasionally used to represent the object to be classified, which maytake the form of a mass spectrum containing a peak, or a group of peaks,or other form of data, e.g., data from a different type of analyticalinstrument, e.g., gas chromatograph or spectrometer. The term “instance”is used as synonymous to “object”.

Of the various classification methods known in the art, the k-NearestNeighbor (kNN) method is a powerful method of nonparametricdiscrimination, or supervised learning. Background literature related tothe kNN method includes E. Fix and J. L. Hodges, “Discriminatoryanalysis. Nonparametric discrimination: consistency properties.” ReportNumber 4, Project Number 21-49-004, USAF School of Aviation Medicine,Randolph Field, Tex. (February 1951). Reprinted in InternationalStatistical Review, 57 (1989) 238-247; E. Fix and J. L. Hodges,“Discriminatory analysis. Nonparametric discrimination: small sampleperformance.” Report Number 11, Project Number 21-49-004, USAF School ofAviation Medicine, Randolph Field, Tex. (August 1952); T. M. Cover andP. E. Hart, “Nearest Neighbor Pattern Classification”, IEEE Transactionson Information Theory, IT-13 (1967) 21-27; and B. W. Silverman and M. C.Jones, “E. Fix and J. L. Hodges (1951): An important contribution tononparametric discriminant analysis and density estimation”,International Statistical Review, 57 (1989) 233-238.

Each object, or instance, to be classified, is characterized by d valuesx_(i), i=1 . . . d and is thus represented by a point in a d-dimensionalspace. In the example of mass spectrometry (MS) data, each value x_(i)represents an intensity of an individual feature, or intensity of anindividual peak, in the mass spectrum. The distance between any twoinstances can be defined in different ways, the simplest of which is theusual Euclidean metric √{square root over (Σ_(i)(x_(i)−x′_(i))²)}., butany other distance measure can also be used. Given a training set (a setof instances with known class assignments/labels) and a positive integerk, classification of the test object is performed as follows.

-   1. Find the k nearest neighbor instances from the training set    instances to the test object.-   2. Determine which of the labels of the k nearest neighbor training    set instances is in the majority.-   3. Assign the label determined as being in the majority in step (2)    to the test object.

This simple algorithm has two noticeable drawbacks. First, it does notproperly take into account the number of instances of each class in thetraining set. Simply adding more instances of a given class to thetraining set would bias classification results in favor of this class.Thus, the algorithm in the above simple form is only applicable wheneach class in the training set is represented by an equal number ofinstances. In practice, this is rarely the case.

Second, the algorithm provides no information on the confidence of classassignment for individual instances. Consider, for example, the case ofk=15 and two classes. It is intuitively clear that the confidence ofclass assignment in the situation where all 15 of the nearest neighborsbelong to the same class is much higher than in the situation where 8belong to one class and 7 belong to another class. In many applications,such as those related to clinical diagnostics, it may be very importantto be able to characterize the confidence of each individual classassignment.

In this document, we address these problems by providing a probabilityestimate of the test instance belonging to each of the classes in thetraining set, based on the class labels of each of the k nearestneighbors from the training set. An example is described below wherethere are two classes of objects in the training set, however themethods can be extended to the situation where there are three or moreclasses. We provide two derivations of the probability estimates, onewithin the kernel density estimation framework (a fixed vicinity of thetest instance determines the number of neighbors), the other within thekNN framework (a fixed number of neighbors determines the size of thevicinity). Both lead to the same result for the probability estimate ofthe test instance belonging to each of the classes.

Unlike the estimates of the overall error rate of kNN classificationthat depend on the probability distributions associated with theclasses, the probability estimates of this disclosure provides areliability of class assignment for each individual test instance,depending only on the (known) training set data and their labels. Italso properly accounts for complications arising when the numbers oftraining instances in the two classes are different, i.e. N₁≠N₂. Here N₁and N₂ are the numbers of instances in the training set that belong,respectively, to class 1 and to class 2, if one considers the two classclassification problems. Extensions to more than two classes areanalogous.

The problem of statistical confidence of kNN classification has beenalso addressed in several other references, including see J. Wang, P.Neskovic and L. N. Cooper, “Partitioning a feature space using a locallydefined confidence measure”, ICANN/ICONIP (2003) 200-203; J. Wang, P.Neskovic and L. N. Cooper, “An adaptive nearest neighbor algorithm forclassification”, Proceedings of the 4th International Conference onMachine Learning and Cybernetics, Guangzhou (2005) 3069-3074; J. Wang,P. Neskovic and L. N. Cooper, “Neighborhood size selection in thek-nearest-neighbor rule using statistical confidence”, PatternRecognition 39 (2006) 417-423; and X.-J. Ma, R. Patel, X. Wang, et al,“Molecular classification of human cancers using a 92-gene real-timequantitative polymerase chain reaction assay”, Arch. Pathol. Lab. Med.130 (2006) 465-473. However, the “confidence level” proposed in the J.Wang et al. papers has a completely different statistical meaning andcannot be used to estimate the reliability of class assignment for eachindividual test instance. The same is true for P-values discussed in theMa et al. paper at p. 466.

Additional prior art of interest includes the paper of Robert P. W.Duin, David M. J. Tax, Classifier Conditional Posterior Probabilities,published in: A. Amin, D. Dori, P. Pudil, and H. Freeman (eds.),Advances in Pattern Recognition, Lecture Notes in Computer Science,Volume 1451, p. 611-619, Springer, Berlin (1998), ISBN978-3-540-64858-1. Other prior art of interest includes U.S. Pat. Nos.7,016,884, 7,359,805, 7,228,239, and 6,003,027.

The probabilistic classification methods and system of this disclosureprovide a facility for determining the reliability of class assignmentfor each individual test instance. The methods depend only on the(known) training set data, and are not dependent on knowledge of theprobability density functions of the training set data, i.e., they arenon-parametric. They also avoid the potential bias in a classificationsystem when the numbers of instances in the two classes in the trainingset are different.

SUMMARY

In one aspect, a method is disclosed for classifying a data set. Thedata set may take the form of a mass spectrum containing one or morepeaks, or other format of data.

The method includes a step of accessing a machine readable memorystoring a training set comprising a number of data sets. Each of thedata sets in the training set has a known class label. Collectively, thedata sets in the training set are members of at least two classes, e.g.,Class 1 and Class 2. The meaning of the class assignments to the datasets in the training set will of course depend on the application. Inone example, data sets of “normal” patients are assigned as “class 1”and data sets of patients having a particular medical condition, e.g.,cancer, are assigned as “class 2”. As another example, data sets ofpatients which derive benefit from treatment for a disease by aparticular family of drug compounds are assigned membership in class 1whereas data sets of patients which do not derive benefit, or sufferadverse effects from treatment with the family of drug compounds areassigned membership in class 2.

The method further includes a step of estimating the probability of thetest instance as being a member of each of the classes in the trainingset. This probability estimate is reflected by a number between 0 and 1.The higher the number, the greater the probability is that the testinstance is a member of the assigned class. Various methods forcalculating this probability estimate are described, includingcalculations and approximations for use where the number of test datapoints in the training set in the different classes is not the same.

The estimating of probability is performed with reference to the classassignments of a group of data sets in the training set which areneighbors to the test instance. These neighbors are located within acertain defined region within the training set. This defined region maybe expressed as all those test data points within a sphere centered onthe test instance to be classified (parameter ω described below), or asa given number of k data points which are closest to the test instance,according to the distance measure being used. In this example, k cantake any integer value greater than or equal to one, and can be eitheran even or an odd number.

The method then classifies the test instance as belonging to the classwith the highest estimated probability.

In some embodiments, the method may also include the step of comparingthe estimates of probabilities for each of the classes to determine ifthe probability difference between the class having the highestprobability estimate and the class having the next highest probabilityestimate is greater than a user-supplied parameter (p-diff below). Forexample, this user-supplied parameter can be 0.1. When the probabilitydifference between the class with the highest probability and the classwith the second highest probability is 0.1 or greater, then theclassification is maintained. If the difference is less that 0.1, thenthe classifier returns a result such as “undefined” or “unable toclassify.”

When the training set includes instances being members of two classes,the probability of the test instance being a member of Class 1 isestimated according to the relation:

${P( {{class}\mspace{14mu} 1} )} = {\frac{k_{1} + 1}{k_{1} + k_{2} + 2} \cdot {{{{}_{}^{}{}_{}^{}}( {1,{{k_{2} + 1};{k_{1} + k_{2} + 3};{1 - \frac{N_{1}}{N_{2}}}}} )}.}}$where ₂F₁(1, k₂+1; k₁+k₂+3; 1−N1/N2) is a calculation of thehypergeometric function ₂F₁. N₁ is the number of objects in the trainingset in the first class, and N₂ is the number of objects in the trainingset in the second class. Also, in this expression, k₁ represents thenumber of neighbors of class 1 within the defined region and k₂represents the number of neighbors in class 2 within the defined region.This expression can be used to calculate the probabilities that the testinstance is a member of each of the two classes in the situation whereN₁ is equal to N₂, and where N₁ is not equal to N₂.

For the situation in which there are more than two classes and samplesizes in the training set are different (i.e., the numbers N_(i) ofobjects in each of the classes in the training set are not necessarilythe same), it is difficult to obtain p(class i) in closed form. In thiscase, the following much simplified estimate may be used:

$\frac{p( {{class}\mspace{14mu} i} )}{p( {{class}\mspace{14mu} j} )} = {\frac{( {k_{i} + 1} )}{( {k_{j} + 1} )} \cdot \frac{N_{j}}{N_{i}}}$

Or, equivalently, each p(class i) is proportional to

${\frac{1}{N_{i}}( {k_{i} + 1} )},{{{while}\mspace{14mu}{\sum\limits_{i = 1}^{N\mspace{14mu}{classes}}{p( {{class}\mspace{14mu} i} )}}} = 1.}$

In one example of a diagnostic application of this invention, the testdata sets take the form of test data (e.g., mass spectrometry (MS) datafrom serum samples) obtained from two classes of patients: 1) a firstclass of patients exhibiting an adverse health condition (e.g., canceror other disease) and 2) a second class of patients that do not sharethe adverse health condition. The classes assigned to the data sets inthe training set correspond to the two classes of patients. The testinstance represents test data obtained from a patient, e.g., MS datafrom a serum sample of a patient, and information is desired as towhether the patient falls into the first or second class. The methods ofthis disclosure provide a way of quantitatively determining theprobability that the test instance falls into class 1 or class 2.

As another example in the diagnostics arena, the data sets in thetraining set are obtained from two classes of patients: 1) a first classof patients that derive benefit from a particular therapy for treatmentof a health condition and 2) a second class of patients that do notderive benefit, or suffer adverse effects from the particular therapyfor treatment of the health condition, and wherein the classes assignedto the data sets correspond to the two classes of patients. In oneexample, the health condition comprises cancer.

In another aspect, a system is provided for performing a classificationof a test instance. The system includes a machine-readable memorystoring a training set comprising a plurality of data sets. Each of thedata sets in the training set is assigned as a member of a class, andcollectively the data sets in the training set form at least twoclasses. The system further includes a computer system. The computersystem may be embodied in any convenient form such as a general purposecomputer having a memory storing software instructions for execution bya processing unit. The computer system is configured, e.g., withhardware and software as described below, as a probabilistic classifier.The classifier estimates the probability of the test instance as being amember of a class in the training set. The module estimates theprobability with reference to the class assignments of data sets in thetraining set which are neighbors to the test instance within a definedregion within the training set. This defined region may be expressed asall those test data points within a sphere centered on the test instanceto be classified (parameter ω described below), or as a given number ofk data points which are closest to the test instance. In this example, kcan take any integer value greater than or equal to one.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram showing a laboratory test processing center,cancer research clinics and cancer patient clinics. The probabilisticclassification methods and system are typically, but not necessarily,implemented in a computer system and associated machine-readable memorystorage, or database located in the laboratory test processing center.

FIG. 2 is a block diagram showing a system for communication andprocessing information between the test processing center, cancerresearch clinics and cancer patient clinics of FIG. 1.

FIG. 3 is a diagram showing a set of instances in a training setbelonging to two different classes, and a test instance to be classifiedby the classifier of this disclosure.

FIG. 4 is a diagram similar to FIG. 3, showing a training set of classlabeled spectra of two different classes, a test instance to beclassified, and a region of the training set which is used in theprobabilistic classifier. This region is shown by parameter ω; howeverthe region can be equivalently represented by a set of k nearestneighbors to the test instance with k being an integer greater than orequal to 1. FIGS. 3 and 4 illustrate the situation where the instancesin the training set can be represented by points in two-dimensionalspace, and the Euclidean measure is used for the distance betweeninstances. The methods of this disclosure can be applied to trainingssets which are not capable of being represented in a two-dimensionalspace, and thus FIGS. 3 and 4 are offered by way of example and notlimitation.

DETAILED DESCRIPTION

The probabilistic classifier features of this disclosure will bedescribed in greater detail later in this document. To fully understandhow the classifier can be implemented in a diagnostic environment, thisdisclosure will describe the invention in the context of classifying amass spectrometry data obtained from a patient serum sample.

I. Overview of Diagnostic Application of a Probabilistic Classifier

In the application U.S. 2007/0231921, the inventors of the instantinvention disclosed a novel method of determining if a patient willderive benefit from a treatment by testing a sample of the patient(e.g., a serum sample) by mass spectroscopy. As an example of oneembodiment of this invention, the inventors have applied their techniqueto a cancer, Non-Small-Cell Lung Cancer (NSCLC). Non-Small-Cell LungCancer is a leading cause of death from cancer in both men and women inthe United States.

Treatment of NSCLC has been relatively poor over the years.Chemotherapy, the mainstay treatment of advanced cancers, is onlymarginally effective, with the exception of localized cancers. Whilesurgery is the most potentially curative therapeutic option for NSCLC,it is not always possible depending on the stage of the cancer.

Recent approaches for developing anti-cancer drugs to treat the NSCLCpatients focus on reducing or eliminating the ability for cancer cellsto grow and divide. These anti-cancer drugs are used to disrupt thesignals to the cells to tell them whether to grow or die. Normally, cellgrowth is tightly controlled by the signals that the cells receive. Incancer, however, this signaling goes wrong and the cells continue togrow and divide in an uncontrollable fashion, thereby forming a tumor.One of these signaling pathways begins when a chemical in the body,called epidermal growth factor, binds to a receptor that is located onthe surface of many cells in the body. The receptor, known as theepidermal growth factor receptor (EGFR) sends signals to the cells,through the activation of an enzyme called tyrosine kinase (TK) that isfound within the cells.

Two anti-cancer drugs that were developed and prescribed to the NSCLCpatients are called gefitinib (trade name “Iressa”) and erlotinib (tradename “Tarceva”). These anti-cancer drugs target the EGFR pathway andhave shown promise in being effective toward treating NSCLC cancer.Iressa and Tarceva inhibit the enzyme tyrosine kinase that appears to beimportant to the growth of cancer cells. Iressa has been used as asingle agent of the treatment of NSCLC that has progressed after, orfailed to respond to, two other types of chemotherapies.

However, only between 10% and 20% of patients in Caucasian populationsderive benefit from Iressa, and this has led to withdrawal of Iressa asa second-line treatment. Surprisingly, the percent of patients derivingbenefit from Iressa in Asia has been considerably higher and Iressa isstilled used. Traceva is still approved and routinely given to patients,but still has response rate concerns. While it appears that Iressa andTraceva have the ability to be effective in some patients, they may notbe drugs effective in treating all patients. There may be many factorsinvolved in a patient's ability to derive benefit from these drugs thatare currently unknown. However, if the method existed that could be usedto predict the effectiveness of these anti-cancer drugs for individualNSCLC patients, doctors could then prescribe these drugs to thosepatients predicted to derive benefit from the anti-cancer drugs.

Our application U.S. 2007/0231921 discloses a diagnostic test todetermine whether a patient will derive benefit from these drugtreatments. The determination is made by measuring the intensity of apredefined set of peaks in a spectrum produced by a mass spectrometerfrom serum extracted from a patient's blood. The mass spectrometerproduces a spectrum having certain peaks that that can be utilized tocompare with spectra produced from serum of patients that derivedbenefit, or did not derive benefit from the drug treatments. It is oftennot necessary to actually determine what chemical compound or compoundsdetermine the intensity of the peak. The intensities of a carefullychosen set of peaks in the mass spectrum can by themselves characterizethe treatment potential for the drug in a specific patient.

The method includes obtaining a test spectrum produced by a massspectrometer from a serum of a patient. The test spectrum (“testinstance” herein) is classified relative to a training set in the formof a group of class labeled spectra produced from respective serum fromother patients at the same or similar clinical stage disease or disorderand known to have derived benefit, or not derived benefit from the drug.The methods of this disclosure can be used in this classification.

The classification methods of this disclosure are implemented as a testprocedure, wherein a patient serum (or plasma) sample is obtained,subjected to mass spectrometry and then the mass spectrum is classifiedwith the probabilistic classifier of this disclosure. The classifiermakes use of the training set. The manner in which this training set isobtained is explained in our application U.S. 2007/0231921 and only abrief overview will be described in this document in order to notobfuscate the present disclosure.

FIG. 1 is a block diagram of an exemplary relationship between alaboratory test processing center 102, cancer research clinics 104 a-104n (collectively 104), and cancer patient clinics 106 a-106 m(collectively 106). The laboratory test processing center 102 operatesto process tests from cancer research clinics 104 and cancer patientclinics 106. In one embodiment, the cancer research clinics 104 andcancer patient clinics 106 are part of the same organization, such as ahospital. The cancer research clinics 104 perform drug trials andtesting to determine effectiveness of certain drugs to treat patients.For example, some patients with non-small-cell lung cancer derivebenefit from particular anti-cancer drugs, and some patients do not.These anti-cancer drugs may include gefitinib and erlotinib that targetthe epidermal growth factor receptor pathway. During clinical studiesand non-clinical studies, the cancer research clinics 104 determinewhether, and to what extent, each patient derives benefit, or suffersfrom the adverse reaction, from the anti-cancer drug.

The cancer research clinics 104 may be any facility that performsclinical studies or otherwise administers cancer medications to cancerpatients and monitors effectiveness of the medications. The cancerresearch clinics 104 may take blood samples and process them to produceblood plasma (the liquid component of blood from which blood cells areremoved) or serum, which is blood plasma having clotting factors, suchas fibrin, removed. The serum or plasma may be processed and used toproduce a spectrum by a mass spectrometer so that the peaks in thespectrum can be detected. In one embodiment, the mass spectrometer is atime-of-flight (TOF) mass spectrometer that uses matrix-assisted laserdesorption/ionization (MALDI). The spectrum may include surrogatemarkers or peaks within the spectrum indicative of certain chemicals ormatter within the serum or plasma.

Continuing with FIG. 1, as a result of the treatment of the patients,effectiveness of the anti-cancer drugs being administered to eachpatient may be recorded and observed. The laboratory test processingcenter 102 receives mass spectral data derived from the samples obtainedfrom the patients, together with associated known clinical results 108from the cancer research clinics. These mass spectra constitute thetraining set. Each spectrum in the training set is given a label “Good”or “Poor” according to the known clinical result for the correspondingpatient. Label “Good” means that the patient derived benefit from thetreatment, while label “Poor” means that the patient did not derivebenefit, or experienced adverse effects from the treatment. After thetraining set has been obtained, the laboratory test processing center102 can perform classification of the test samples. The laboratory testprocessing center 102 receives test spectra 110 a-110 m (collectively110) from cancer patient clinics 106 and performs analysis on these testspectra 110 to determine which class each test spectrum (i.e., eachpatient) is most likely to belong to. Alternatively, rather thanreceiving mass spectra, the laboratory test processing center 102 mayreceive blood samples or serum samples to process and produce the massspectra for processing and classification.

Once the laboratory test processing center 102 has classified the testspectrum 110, and optionally makes the determination as to whether thecancer patient is likely to derive benefit from the anti-cancer drug,classification results 112 a-112 m (collectively 112) may be deliveredto the respective cancer patient clinic 106. In one embodiment, theclassification results are class labels produced by a classifierfunction as further described herein below.

Although shown separately, the laboratory test processing center 102 maybe part of the cancer research clinics 104 or cancer patient clinics106. In one embodiment, the laboratory test processing center 102 isfunctionally incorporated into test equipment, such as a massspectrometer or processing system operating in conjunction with the testequipment. Alternatively, the functionality may be incorporated onto acomputer system or other processing system that is configured to performthe various processing utilized in processing and classifying thespectra and not part of or associated with the test equipment. Forexample, the computer system may be a server operated by the laboratorytest processing center 102, clinic research clinic 104, and/or cancerpatient clinic 106. Although FIG. 1 describes cancer clinics, it shouldbe understood that these clinics may be common clinics or clinicsspecific to a particular disease or illness.

FIG. 2 is a block diagram of an exemplary system 200 for communicatingand processing information between the laboratory test processing center102, cancer research clinics 104, and cancer patient clinics 106 ofFIG. 1. A laboratory test processing center computing system 202 may beoperated by the laboratory test processing center 102. Cancer researchclinic servers 204 a-204 n (collectively 204) may be operated by thecancer research clinics 104 and cancer patient clinic servers 206 a-206m (collectively 206) may be operated by the cancer patient clinics 106.Each of the computing system 202 and servers 204 and 206 may communicateover network 208 via digital data packets 209 a-209 b or othercommunication technique as understood in the art. The network 208 may bethe Internet or other public or non-public communication network.

The laboratory test processing center computing system 202 may include aprocessor 210 executing software 212 for processing the mass spectra todetermine classifications of all or a portion thereof in accordance withthe principles of the present invention as described further below. Thecomputing system 202 may further include memory 214, in which thesoftware 212 may reside when being executed, input/output (I/O) unit216, which may perform the communication over the network 208, andmachine-readable memory storage device 218 to which the processor 210communicates. The storage device 218 may include one or more databases220 a-220 n (collectively 220) in which the mass spectra, and otherrelated data is stored to enable the laboratory test processing center102 to determine whether a cancer patient is likely to derive benefitfrom an anti-cancer drug. The storage device 218 may also store massspectra, peak intensities and other related data directly, without theuse of the database. It should be understood that the storage device 218may include one or more storage devices and located within or externalfrom the computing system 202. It should further be understood that theprocessor 210 may include one or more processors. Still yet, it shouldbe understood that the computing system 202 may be directly orindirectly in communication with the network 208.

In accordance with FIG. 2, the cancer research clinic servers 204 maycommunicate spectral data with associated known clinical results to thelaboratory test processing center computing system 202. This data, andthe data derived from it, constitutes the training set that will be usedby the probabilistic classifier. The cancer patient clinic servers 206may communicate test spectra 110 to the laboratory for the processor 210to automatically or semi-automatically with the assistance of thescientist or otherwise, classify the test spectra 110 for the cancerpatient clinics 106. The laboratory test processing center computingsystem 202 may process the test spectra 110 and communicateclassification results 112 (FIG. 1) back to the cancer patient clinicservers 206. As a result of classifying the test spectra 110, thecomputing system 202 may store classification results and utilize theresults to generate statistical information that may be used for variousother purposes, such as efficacy of the anti-cancer drug.

A database, such as database 220 (FIG. 2), or any other appropriatemachine-readable storage medium, may be utilized to receive and storedifferentiating peaks, training sets, mass spectrometer diagnostics,and/or other output parameters from the classification and diagnosticprocess as described. These parameters may be stored and used for futureclassification of new spectra from new cancer patients.

Data analysis plays a central role in the discovery of peaksdifferentiating mass spectra from patients with different clinicaloutcome and their use either as discovery leads for immuno-histochemicalassays or directly in mass spectrometry based diagnosis. Our U.S. Patentapplication 2007/0231921 discloses developing, testing and analysisprocedures for discovery of such peaks. The integrated analysis systemincludes a number of tools that facilitate the detection ofdifferentiating peaks in the mass spectra, while at the same timeproviding rigorous tools for the assessment of their significance andvalidation of the results.

In performing the data analysis, it is generally accepted that cancerouscells have expression levels of specific proteins that are differentfrom those of normal cells. Distinct stages of disease are accompaniedby changes in expression levels of specific proteins, e.g., changes inthe expression levels of cell-binding proteins in the case of metastaticcancer. In the case of serum samples, and to delineate serum testingfrom tissue sample testing, it is unlikely that direct tumor excretionsare measured due to dilution of these excretions in the blood. Thedifferentiating peaks in serum (or other bodily liquids) samples arisein all likelihood due to a host response reaction dependent on thedisease state, such as autoimmune reactions. By detectingdifferentiating peaks in the spectra, correlation of changes withclinically relevant questions may be performed. To detectdifferentiating peaks in the spectra of value, independent of theirfurther use, either directly as a diagnostic tool or as leads forimmuno-histochemical based testing, the following issues may beaddressed during the differentiating peaks discovery process, includingthe data analysis stage:

Reproducibility: the results of an analysis are to be reproducible.Differentiating peaks are to be repeatably found in the various diseaseand control groups, and the intensities of these differentiating peakscannot vary too much within a group. As a simplified measure ofreproducibility, coefficients of variations (CV), which have become astandard for assessing diagnostic tests, may be provided by softwareexecuted on a processor. The variations of peak intensities within agroup, and even within the same sample, may be measured, characterized,and used in downstream analysis and classification.

Robustness: differentiating peaks are to be robust against unavoidablevariations in sample preparation and handling, as well as againstvariations arising from trends in mass spectrometer characteristics.Another reason for patient to patient variability arises from irrelevantdifferences in the biological state of a patient, for example, thedigestive state at the time of sample gathering. Criteria may bedeveloped for distinguishing irrelevant changes from biologicallysignificant ones. In the design of classifiers (i.e., classifierfunctions or algorithms), which are functions that map frommulti-dimensional feature space (e.g., 12 differentiating peaks) toclass label space (e.g., “good,” “poor,” or “undefined”) and duringfeature extraction, real differentiating peaks should not change verymuch while making small changes to data analysis parameters. Similarlylocated differentiating peaks should be found in different data sets.

Interpretability: The resulting differentiating peaks may be put in thecontext of biological interpretability. First, identifieddifferentiating peaks are generally visually noticeable in the massspectra. The m/z positions of differentiating peaks may give valuableinformation on the biological relevance of underlying molecules thatcause these differentiating peaks. This allows for the interpretationand filtering of the differentiating peaks arising from biologicallyirrelevant procedures. For example, the measurement of differenthemoglobin content of cancerous versus normal samples, may have littleor no clinical relevance. In some cases, it may turn out that clinicallyrelevant changes in the spectrum are non-linear combinations ofintensities of multiple peaks or features in the spectrum, and are notthe simple up/down regulations. Even in this case, the differentiatingpeaks and/or features in the spectra should be detectable against thenoise in the spectra, and the functions with which to evaluate markersshould be made explicit.

Sensitivity: Great effort is usually undertaken to gather samples andgenerate mass spectra. Great care is also taken to avoid missingrelevant differentiating peaks or features in the mass spectra, whichmay result from using data analysis algorithms that are not selective orsensitive enough to actually find these differentiating peaks in aspectrum. For example, if an m/z range is defined as being relevant to afeature, this range is to be broad enough to contain the feature, butshould not be too broad to lump in other features present in thespectrum.

The task of comparing mass spectra for the extraction of differentiatingpeaks is made difficult by the specific nature of these spectra due tointrinsic intensity variations. The ionization probability of individualions depends on the local sample chemistry (e.g., ion suppressioneffects). The absolute mass scale can exhibit slight variations fromspectrum to spectrum.

Mass spectrometer-specific variations may be measured to reduce oreliminate these variations (in the case of background variations) or toprovide measures to assess the relevant significance of signals byestimating the local noise level. It is important to avoid introducingadditional variations arising from data preprocessing and analysis. Forexample, peak picking software that is often bundled with many massspectrometers has been found to be unreliable to directly use thesepeaks in a comparative spectral analysis. Early attempts at spectralcomparison have instead resorted to using the whole mass spectrum itselfin their comparison and classification algorithms. Whole spectra,however, include many thousands of individual data points, most of whichare measurements of instrument noise, with only relevant informationbeing confined to the peaks in the mass spectra. As a result, theapplication of these attempts to classify serum samples has led toexaggerated claims that could not be reproduced in other laboratories.

II. Probabilistic Classifiers

The procedure of classifying a test object (assigning a class label to atest object) in the preferred embodiment uses a probabilisticclassifier. The probabilistic classifier is constructed as a result of asupervised learning procedure. Supervised learning is the technique forconstructing a classifier from the training data. In one embodiment, theclassifier is the mapping from a high-dimensional feature space to labelspace, i.e. from feature/peak intensities to disease label or responselabel (otherwise designated as class label). The output of theprobabilistic classifier is an estimate of probability, for each classrepresented in the training set, that the test object belongs to thisclass. The test object may be subsequently assigned the class label ofthe class that has the highest associated probability. In oneembodiment, a probabilistic k nearest neighbors (KNN) algorithm may beutilized for the classification.

The method includes a step of accessing a machine-readable memorystorage 218 or a database 220, (FIG. 2) storing a training setcomprising a number of data sets. Each of the data sets in the trainingset has been previously assigned as a member of a class. Collectively,the data sets in the training set are members of at least two classes,e.g., class 1 and class 2. The meaning of the class assignments to thedata sets in the training set will of course depend on the application.In one example, data sets (e.g. mass spectra) of “normal” patients areassigned as “class 1” and data sets of patients having a particularmedical condition, e.g., cancer, are assigned as “class 2”. As anotherexample, data sets (e.g. mass spectra) of patients which derive benefitfrom the treatment for a disease by a particular family of drugcompounds are assigned membership in class 1 whereas data sets ofpatients which do not derive benefit from the family of drug compoundsare assigned membership in class 2.

In one aspect of this disclosure, the computer system 202 (FIG. 2)implements a module in software and/or hardware for estimating of theprobability of the test instance (e.g., test spectrum) as being a memberof each class in the training set. The likelihood of correctness of theclassification of each individual test instance can be measured by theseestimates of probability. The module estimates the probability withreference to the class assignments of data sets in the training setwhich are neighbors to the test instance within a defined region withinthe training set. As will be explained below, this region can be definedeither in terms of a geometric region ω in the training set centered onthe test instance, or in terms of a fixed number of k nearest neighborsin the training set to the test instance. Either approach yields thesame general result.

As explained previously, k-Nearest Neighbor (kNN) is a powerful methodof nonparametric discrimination, or supervised learning. Each object, ortest instance, to be classified, is characterized by d values x_(i), i=1. . . d and is thus represented by a point in a d-dimensional space. Thedistance between the two instances can be defined in different ways, thesimplest of which is the usual Euclidean metric √{square root over(Σ_(i)(x_(i)−x′_(i))²)}. but others can be used without loss ofgeneralizability. Given a training set (a set of instances with knownclass labels) and a positive integer k, classification of the testinstance is performed as follows.

-   1. Find the k nearest neighbor instances from the training set    instances to the test object.-   2. Determine which of the training labels of the k nearest neighbor    training instances is in the majority.-   3. Assign the label determined as being in the majority in step (2)    to the test object.

An example of the kNN algorithm will now be explained in conjunctionwith FIG. 3. FIG. 3 is a graph 1100 showing an exemplary group of classlabeled spectra indicia representative of two different classes ofpatients and a test spectrum instance to be classified. FIG. 3 depictsan example where each spectrum is characterized by two real numbers Xand Y, which can be, for example, intensities of the two particularfeatures. In this case each spectrum can be represented by a point intwo-dimensional space, as shown in graph 1100 in FIG. 3. If the featurespace were a 12-dimensional feature space (i.e., each spectrum werecharacterized by 12 numbers, e.g. intensities of 12 features or peaks),then it would not be possible to easily graphically represent thespectra, so a two-dimensional feature space is utilized as an example.In practice, the feature space is typically a multi-dimensional space.

In this case, the spectra in the training set are classified with classlabels as “good” 1102 and “poor” 1104, where the “good” class labeledspectra indicia 1102 are represented on the graph 1100 as one patternand the “poor” class labeled spectra indicia 1104 are represented asanother pattern. Thus, in this example, there are two classes in thetraining set, and the objects in the training set belong to either class1 (“good”) or class 2 (“poor”). As previously described, class labeledspectra may be obtained from a cancer research clinic and used astraining samples for classification purposes based on the clinicalresults of a cancer patient treated with an anti-cancer drug, such asIressa. A test spectrum 1106 to be classified is placed on the graph1100 in a location representative of a test spectrum from a new cancerpatient for whom a treatment plan is being determined. The location ofthe test spectrum indicia 1106 is based on the amplitudes of the twofeatures (i.e., the x and y amplitudes). As shown, and in accordancewith the KNN algorithm, the closest three class labeled spectra indicia1108 a, 1108 b, and 1108 c will be used to classify the test spectrum1106 (k=3 in this example). Since among them there are two members inthe “good” class 1102, and only one member in the “bad” class 1104, thetest spectrum is classified as “good.”

The kNN algorithm has two noticeable drawbacks. First, it does notproperly take into account the number of objects of each class in thetraining set, in the case when this number is not the same for everyclass. In practice there may be many more objects of one class in thetraining set than for the other class or classes. When the training setis skewed by adding more instances of a given class to the training set,this biases the classification results in favor of this class. Thus, thealgorithm in the simple form illustrated in FIG. 3 is only applicablewhen each class in the training set is represented by an equal number ofinstances.

Second, the algorithm provides no information on the confidence of classassignment for individual test instances. Consider, for example, thecase of k=15 and two classes. It is intuitively clear that theconfidence of class assignment in the 15:0 situation is much higher thanin the 8:7 situation. In many applications, such as those related toclinical diagnostics, it is very important to be able to characterizethe significance of each individual class assignment.

Here we address these problems by providing a probability estimate ofthe test instance belonging to each of the classes in the training set,based on the class labels of neighbor instances from the training set ina defined region, e.g. each of the k nearest neighbors from the trainingset. The discussion is presented in the case where the training setconsists of objects belonging to two classes, but the principles can beextended to a training set consisting of more than two classes. Weprovide two derivations, one within the kernel density estimationframework (a fixed vicinity of the test instance determines the number kof neighbors), the other within the kNN framework (a fixed number k ofneighbors determines the size of the vicinity). Both lead to the sameresult for the probability estimate of the test instance belonging toeach of the classes.

FIG. 4 shows a training set 400 composed of a multitude of objects whichbelong to two classes. The objects belonging to class 1 are shown assmall circles 402 and the objects belonging to class 2 are shown bythe + symbol, 404. The test instance to be classified is shown by thestar 1106. The defined region which is used in the probabilisticclassifier can be the k points in the training set which are nearest tothe test instance 1106 and contained within a sphere ω centered on testinstance 1106 (the kernel approach below), or by selecting k nearestneighbors (the kNN framework below).

A. Probability Estimate Within the Kernel Approach

Consider the case of two classes in the training set as shown in FIG. 4,which we denote as 1 and 2. Each instance is represented by a point{right arrow over (x)}=(x₁ . . . x_(d)) in a d-dimensional space. Denotethe full d-dimensional space by Ω. Class 1 is characterized by the(unknown) probability distribution p₁({right arrow over (x)}),∫_(Ω)p₁({right arrow over (x)})d{right arrow over (x)}=1. Class 2 ischaracterized by the (unknown) probability distribution p₂({right arrowover (x)}), ∫_(Ω)p₂({right arrow over (x)})d{right arrow over (x)}=1.The training set consists of N₁ points drawn from class 1, and N₂ pointsdrawn from class 2. Denote a vicinity of the test point (representingthe test instance) by ω. (In case the Euclidean distance is used, ω is asphere centered at the test point, see FIG. 4, but this is irrelevantfor the following.) For a given realization of the training set, weobserve k₁ points in ω from class 1, and k₂ points in ω from class 2.

We make the following assumptions and approximations.

-   1. Existence of probability densities. As already stated above, the    training set is considered to be a sample drawn from the underlying    probability distributions with densities p₁({right arrow over (x)})    and p₂({right arrow over (x)}).-   2. Fixed ω. The vicinity ω of the test point is considered fixed: It    can depend on the position of the test point, on the probability    distributions from which the training set is drawn, as well as on N₁    and N₂, but is assumed to stay the same for each realization of the    training set.-   3. Uniformity within ω. The vicinity ω is sufficiently small, such    that probability densities for the classes, p₁({right arrow over    (x)}) and p₂({right arrow over (x)}), are approximately constant    within ω.-   4. Poisson approximation. For each class, we make an approximation    that the number of training set instances of this class in ω is    drawn from the Poisson distribution. This approximation is valid    when k_(i)<<N_(i), ∫_(ω)p_(i)({right arrow over (x)})d{right arrow    over (x)}<<1, i=1,2.

In the Poisson approximation, k_(i) is drawn from the Poissondistribution with expectation value λ_(i),λ_(i) =N _(i)∫_(ω) p _(i)({right arrow over (x)})d{right arrow over(x)},i=1,2.

Assuming equal prior probabilities for class assignment of the testpoint, that is, P(class 1)=P(class 2)=0.5 in the absence of anyinformation about the neighbors, the probabilities of the test pointbelonging to class 1 or to class 2 are as follows:

$\frac{P( {{class}\mspace{14mu} 1} )}{P( {{class}\mspace{14mu} 2} )} = {\frac{\int_{\omega}{{p_{1}( \overset{arrow}{x} )}{\mathbb{d}\overset{arrow}{x}}}}{\int_{\omega}{{p_{2}( \overset{->}{x} )}{\mathbb{d}\overset{arrow}{x}}}}.{Thus}}$${P( {{class}\mspace{14mu} 1} )} = {\frac{\int_{\omega}{{p_{1}( \overset{arrow}{x} )}{\mathbb{d}\overset{arrow}{x}}}}{{\int_{\omega}{{p_{1}( \overset{arrow}{x} )}{\mathbb{d}\overset{arrow}{x}}}} + {\int_{\omega}^{\;}{{p_{2}( \overset{arrow}{x} )}{\mathbb{d}\overset{arrow}{x}}}}} = {\frac{\lambda_{1}/N_{1}}{{\lambda_{1}/N_{1}} + {\lambda_{2}/N_{2}}}.}}$

Here we have also implicitly used the uniformity assumption (assumption3). Now we can estimate λ₁ and λ₂ in the usual Bayesian manner. Both k₁and k₂ are assumed to obey the Poisson distribution,

${p( k \middle| \lambda )} = {\frac{\lambda^{k}}{k!}{{\mathbb{e}}^{- \lambda}.}}$

Denoting the prior distribution for λ by p₀(λ), by standard Bayesianreasoning we obtain

${p( \lambda \middle| k )} = {\frac{{p( k \middle| \lambda )}{p_{0}(\lambda)}}{\int{{\mathbb{d}\lambda}\;{p( k \middle| \lambda )}{p_{0}(\lambda)}}}.}$

Assuming from now on a flat prior distribution of λ, p₀(λ)=const, weobtain

${{p( \lambda \middle| k )} = {{p( k \middle| \lambda )} = {\frac{\lambda^{k}}{k!}{{\mathbb{e}}^{- \lambda}.{Eventually}}}}},{{P( {{class}\mspace{14mu} 1} )} = {\int_{0}^{\infty}{{\mathbb{d}\lambda_{1}}{\int_{0}^{\infty}{{\mathbb{d}\lambda_{2}}\;\frac{\lambda_{1}}{\lambda_{1} + {( {N_{1}/N_{2}} )\lambda_{2}}}{p_{1}( \lambda_{1} )}{p_{2}( \lambda_{2} )}}}}}},{where}$${{p_{1}( \lambda_{1} )} = {\frac{\lambda_{1}^{k_{1}}}{k_{1}!}{\mathbb{e}}^{- \lambda_{1}}}},{{p_{2}( \lambda_{2} )} = {\frac{\lambda_{2}^{k_{2}}}{k_{2}!}{{\mathbb{e}}^{- \lambda_{2}}.}}}$

Computation of this integral gives

$\begin{matrix}{{P( {{class}\mspace{14mu} 1} )} = {\frac{k_{1} + 1}{k_{1} + k_{2} + 2} \cdot {{{{}_{}^{}{}_{}^{}}( {1,{{k_{2} + 1};{k_{1} + k_{2} + 3};{1 - \frac{N_{1}}{N_{2}}}}} )}.}}} & (1)\end{matrix}$where ₂F₁(1, k₂+1; k₁+k₂+3; 1−N1/N2) is a calculation of thehypergeometric function ₂F₁. The ₂F₁ hypergeometric function is known topersons skilled in this art and is described, e.g., in Handbook ofMathematical Functions, Ed. M. Abramowitz and I. A. Stegun, Dover, N.Y.,1965, see Chapter 15, which is incorporated by reference herein. Thedefinition of the ₂F₁ function is given in section 15.1.1 on page 556 ofthe Handbook of Mathematical Functions. The function is also describedin open source mathematics libraries, including algorithms forcalculating this function. Free code for calculating the ₂F₁ function isavailable at http://www.netlib.org/cephes/ Corresponding documentationis available at http://www.netlib.org/cephes/doubldoc.html#hyp2f1. Thiscode and the corresponding documentation is also incorporated byreference herein.

Equation (1) is our main result for calculating a probability that atest object belongs to a given class, and can be used in the situationwhere N₁ and N₂ are the same, or when they are different. For equalsample sizes in the training set (N₁=N₂) this simplifies to thefollowing:

$\begin{matrix}{{{P( {{class}\mspace{14mu} 1} )} = \frac{k_{1} + 1}{k_{1} + k_{2} + 2}},{\frac{P( {{class}\mspace{14mu} 1} )}{P( {{class}\mspace{14mu} 2} )} = {\frac{k_{1} + 1}{k_{2} + 1}.}}} & (2)\end{matrix}$

For the situation in which there are more than two classes and samplesizes in the training set are different (i.e., the numbers N_(i) ofobjects in each of the classes in the training set are not necessarilythe same), it is difficult to obtain p(class i) in closed form. In thiscase, the following much simplified estimate may be used:

$\frac{p( {{class}\mspace{14mu} i} )}{p( {{class}\mspace{14mu} j} )} = {\frac{( {k_{i} + 1} )}{( {k_{j} + 1} )} \cdot \frac{N_{j}}{N_{i}}}$

Or, equivalently, each p(class i) is proportional to

${\frac{1}{N_{i}}( {k_{i} + 1} )},{{{while}\mspace{14mu}{\sum\limits_{i = 1}^{N\;{classes}}{p( {{class}\mspace{14mu} i} )}}} = 1}$

Once the probabilities for each of the classes are calculated, thecomputer system (202, FIG. 2) performing classification of the testinstance classifies the test instance to the class with the highestestimated probability. Furthermore, the classifier can then makecomparisons between such probabilities. For example, a parametercharacterizing the confidence of classification is a user-suppliedparameter, p-diff, that defines how different the class probabilitieshave to be in order to assign a test instance to one of the classes. Forexample, if p-diff is set to 0.1 and the probability for class 1 is 0.6and for class 2 is 0.4, then the difference is 0.2 and is greater than0.1, thus the test instance (spectrum) is assigned to class 1. If, onthe other hand the class probability for class 1 is 0.52 and for class 2is 0.48, then the difference is 0.04, which is smaller than 0.1, thusthe classifier returns a class label as being “Undefined.” The value ofthe user-supplied parameter, p-diff, may of course vary and take on someother value, such as 0.25 or 0.3. The value that is selected forparticular application may depend on the requirements for the confidenceof classification.

While the modified, probabilistic KNN algorithm disclosed above may beutilized as the classification algorithm, it can be used in conjunctionwith other alternative classification algorithms, e.g., as a check ofthe robustness of the classification produced by the otherclassification or clustering algorithm. Such algorithms may includefuzzy KNN, Kernel methods (e.g., SVM), spectral clustering, kernel PCA,non-parametric clustering, k-Means, k-Histograms, hierarchicalclustering, and random forests, for example.

Unlike the estimates of the overall error rate of kNN classificationthat depend on the probability distributions associated with theclasses, the general result of equation (1) provides an estimate of thereliability of class assignment for each individual test instance,depending only on the (known) training set data. It also properlyaccounts for complications arising when the numbers of traininginstances in the two classes are different, i.e. N₁≠N₂.

B. Probability Estimate Within the kNN Framework

The above section describes a probabilistic classifier which operates ina defined region around the test spectrum, in which this defined regionis obtained in the fixed-ω framework. This section will demonstrate thatthe defined region can be defined for a fixed value of k, i.e. in theproper kNN framework. For each of the k nearest neighbors to the testspectrum, we have the probability

$\begin{matrix}{\begin{matrix}{{\overset{\sim}{p}}_{1} \equiv {P( {{neighbor}\mspace{14mu}{belongs}\mspace{14mu}{to}\mspace{14mu}{class}\mspace{14mu} 1} )}} \\{= {\frac{N_{1}{\int_{\omega}^{\;}{{p_{1}( \overset{->}{x} )}\ {\mathbb{d}\overset{->}{x}}}}}{{N_{1}{\int_{\omega}^{\;}{{p_{1}( \overset{->}{x} )}\ {\mathbb{d}\overset{->}{x}}}}} + {N_{2}{\int_{\omega}^{\;}{{p_{2}( \overset{->}{x} )}\ {\mathbb{d}\overset{->}{x}}}}}}.}}\end{matrix}{Then}{{{P( {{k_{1}\mspace{14mu}{of}\mspace{14mu} k\; N\; N\mspace{14mu}{belong}{\mspace{11mu}\;}{to}\mspace{14mu}{class}\mspace{14mu} 1}❘{\overset{\sim}{p}}_{1}} )} = {\begin{pmatrix}k \\k_{1}\end{pmatrix}{{\overset{\sim}{p}}_{1}^{k_{1}}( {1 - {\overset{\sim}{p}}_{1}} )}^{k - k_{1}}}},}} & (3)\end{matrix}$where NN stands for “nearest neighbors”. Thus

$\begin{matrix}{P( {{{{{\overset{\sim}{p}}_{1} {k_{1}\mspace{14mu}{of}\mspace{14mu} k\; N\; N\mspace{14mu}{belong}\mspace{14mu}{to}{\mspace{11mu}\;}{class}\mspace{14mu} 1} )}==\frac{{P( {{k_{1}\mspace{14mu}{of}\mspace{14mu} k\; N\; N\mspace{14mu}{belong}{\mspace{11mu}\;}{to}\mspace{14mu}{class}\mspace{14mu} 1}❘{\overset{\sim}{p}}_{1}} )}{P_{0}( {\overset{\sim}{p}}_{1} )}}{\int{{P( {{k_{1}\mspace{14mu}{of}\mspace{14mu} k\; N\; N\mspace{14mu}{belong}{\mspace{11mu}\;}{to}\mspace{14mu}{class}\mspace{14mu} 1}❘{\overset{\sim}{p}}_{1}} )}{P_{0}( {\overset{\sim}{p}}_{1} )}{\mathbb{d}{\overset{\sim}{p}}_{1}}}}} = {\frac{\begin{pmatrix}k \\k_{1}\end{pmatrix}{{\overset{\sim}{p}}_{1}^{k_{1}}( {1 - {\overset{\sim}{p}}_{1}} )}^{k - k_{1}}}{\int_{0}^{1}{\begin{pmatrix}k \\k_{1}\end{pmatrix}{{\overset{\sim}{p}}_{1}^{k_{1}}( {1 - {\overset{\sim}{p}}_{1}} )}^{k - k_{1}}\ {\mathbb{d}{\overset{\sim}{p}}_{1}}}} = {( {k + 1} )\begin{pmatrix}k \\k_{1}\end{pmatrix}{{\overset{\sim}{p}}_{1}^{k_{1}}( {1 - {\overset{\sim}{p}}_{1}} )}^{k - k_{1}}}}},} } & (4)\end{matrix}$

where we have again assumed a flat prior distribution of {tilde over(p)}₁: P₀({tilde over (p)}₁)=const. From (3) we obtain

$\frac{\int_{\omega}^{\;}{{p_{2}( \overset{->}{x} )}\ {\mathbb{d}\overset{->}{x}}}}{\int_{\omega}^{\;}{{p_{1}( \overset{->}{x} )}\ {\mathbb{d}\overset{->}{x}}}} = {\frac{N_{1}}{N_{2}}{( {\frac{1}{{\overset{\sim}{p}}_{1}} - 1} ).}}$

Then for given {tilde over (p)}₁ the probability that the test pointbelongs to class 1 is

${P( {{class}\mspace{14mu} 1} )} = {\frac{1}{1 + \frac{\int_{\omega}^{\;}{{p_{2}( \overset{->}{x} )}\ {\mathbb{d}\overset{->}{x}}}}{\int_{\omega}^{\;}{{p_{1}( \overset{->}{x} )}\ {\mathbb{d}\overset{->}{x}}}}} = {\frac{N_{2}{\overset{\sim}{p}}_{1}}{{N_{2}{\overset{\sim}{p}}_{1}} + {N_{1}( {1 - {\overset{\sim}{p}}_{1}} )}}.}}$

Finally, using (4),

$\begin{matrix}\begin{matrix}{{P( {{class}\mspace{14mu} 1} )} = {\int_{0}^{1}{\frac{N_{2}x}{{N_{2}x} + {N_{1}( {1 - x} )}}( {k + 1} )\begin{pmatrix}k \\k_{1}\end{pmatrix}{x^{k_{1}}( {1 - x} )}^{k - k_{1}}\ {\mathbb{d}x}}}} \\{{= {\frac{k_{1} + 1}{k_{1} + k_{2} + 2} \cdot {{{}_{}^{}{}_{}^{}}( {1,{{k_{2} + 1};{k_{1} + k_{2} + 3};{1 - \frac{N_{1}}{N_{2}}}}} )}}},}\end{matrix} & (5)\end{matrix}$which is identical to the result (1) obtained in the previous section.

As noted above, the probabilistic classifier is applicable in a varietyof contexts, and the disclosed embodiments are offered by way ofillustration and not limitation. For example, the methods may be used toclassify different types of test instances besides MS data, or used fordifferent diagnostic or prognostic purposes besides those describedherein. Additionally, the test data can be obtained from other types ofliquids or tissue samples besides serum.

From the foregoing, it will be appreciated that a system has beendescribed for classification of a test instance (FIG. 4, 1106),comprising:

a machine-readable storage device (218) storing a training set (FIG. 4,400) comprising a plurality of objects (402, 404), each of the objectsin the training set being assigned as a member of a class, collectivelythe objects in the training set comprising members of at least twoclasses (see FIG. 4); and

a computer system (210 FIG. 2) coupled to the machine-readable storagedevice (218) configured as a probabilistic classifier, the classifierestimating the probability of the test instance as being a member ofeach class in the training set, the module estimating the probabilitywith reference to the class assignments of k objects in the training setwhich are neighbors to the test instance within a defined region withinthe training set. The defined region within the training set may takethe form of a sphere ω centered about the test instance 1106 (FIG. 2),and wherein there are k₁ neighbors in class 1 within ω and there are k₂neighbors in class 2 within ω. The size of sphere ω is preferablyselected such that probability density for classes 1 and 2 areapproximately constant within the sphere ω. Alternatively, the definedregion used by the probabilistic classifier comprises a set of k objectswithin the training set which are the k closest objects to the testinstance.

In the situation where the training set 400 is composed of objects intwo classes, class 1 and class 2, and each of the two classes have thesame number N of members in the training set, the computer system isprogrammed to determine the probability of the test instance being amember of Class 1 by the relation:P(class 1)=(k ₁+1)/(k ₁ +k ₂+2)and wherein the computer system is programmed to determine theprobability of the test instance being a member of Class 2 by therelation:P(class 2)=(k ₂+1)/(k ₁ +k ₂+2)where k₁ represents the number of neighbors of class 1 within thedefined region and k₂ represents the number of neighbors in class 2within the defined region.

In the event that the training set comprises objects being members oftwo classes, class 1 and class 2, the computer system is programmed todetermine the probability of the test instance being a member of class 1according to the relation:

${P( {{class}\mspace{14mu} 1} )} = {\frac{k_{1} + 1}{k_{1} + k_{2} + 2} \cdot {{{{}_{}^{}{}_{}^{}}( {1,{{k_{2} + 1};{k_{1} + k_{2} + 3};{1 - \frac{N_{1}}{N_{2}}}}} )}.}}$where ₂F₁ (1, k₂+1; k₁+k₂+3; 1−N1/N2) is a calculation of thehypergeometric function ₂F₁. This result can be used both when classes 1and 2 in the training set have the same number of objects N₁ and N₂,respectively, in the training set, or when N₁ and N₂ are different.

When there are at least three classes in the training set and N₁ and N₂are different, the probability p(class i) of the test instance being amember of class i in the training set is approximated as beingproportional to the expression:

${\frac{1}{N_{i}}( {k_{i} + 1} )},{{{while}\mspace{14mu}{\sum\limits_{i = 1}^{N\;{classes}}{p( {{class}\mspace{14mu} i} )}}} = 1}$

When there are at least three classes in the training set and N₁ and N₂are different, the ratio of the probabilities of the test instance beinga member of class i in the training set and class j in the training setis approximated by the relation:

$\frac{p( {{class}\mspace{14mu} i} )}{p( {{class}\mspace{14mu} j} )} = {\frac{( {k_{i} + 1} )}{( {k_{j} + 1} )} \cdot \frac{N_{j}}{N_{i}}}$where N_(j) is the number of objects in class j and N_(i) is the numberof objects in class i.

The objects in the training set can take the form of data sets obtainedfrom two classes of patients: 1) a first class of patients exhibiting anadverse health condition, e.g. cancer or other disease and 2) a secondclass of patients that do not exhibit the adverse health condition. Theclasses assigned to the data sets in the training set correspond to thetwo classes of patients. In this embodiment, the probabilisticclassifier is used to classify the patient as either having or nothaving the adverse health condition. As another example, the data setsin the training set are obtained from two classes of patients: 1) afirst class of patients that derive benefit from a particular therapyfor treatment of a health condition (e.g., patents that derive benefitfrom the EGFR drugs in treatment of non-small cell lung cancer) and 2) asecond class of patients that do not derive benefit from the saidtherapy. The classes assigned to the data sets in the training setcorrespond to the two classes of patients.

Thus, the above detailed description is not intended to be limiting inscope. Persons of skill in this art will immediately envisage themethods and variations used to implement this invention in other areasthan those described in detail. All questions regarding scope of theinvention are to be answered by reference to the appended claims.

1. A system for classification of a test object, comprising: amachine-readable storage device storing a training set comprising aplurality of objects, each of the objects being assigned as a member ofa class, collectively the objects in the training set comprising membersof at least two classes; and a computer system coupled to themachine-readable storage device configured as a probabilisticclassifier, the probabilistic classifier estimating the probability ofthe test object as being a member of each of the classes in the trainingset, wherein the probabilistic classifier estimates the probabilitieswith reference to the class assignments of objects in the training setwhich are neighbors to the test object within a defined region withinthe training set; and wherein the training set comprises objects beingmembers of two classes, class 1 and class 2, wherein classes 1 and 2 inthe training set have N₁ and N₂ numbers of objects respectively, in thetraining set and wherein the computer system is programmed to determinethe probability P(class 1) of the object being a member of class 1according to the relation:${P( {{class}\mspace{14mu} 1} )} = {\frac{k_{1} + 1}{k_{1} + k_{2} + 2} \cdot {{{}_{}^{}{}_{}^{}}( {1,{{k_{2} + 1};{k_{1} + k_{2} + 3};{1 - \frac{N_{1}}{N_{2}}}}} )}}$where ₂F₁(1, k₂+1; k₁+k₂+3; 1−N1/N2) is a calculation of thehypergeometric function ₂F₁ and where k₁ represents the number ofneighbors of class 1 within the defined region and k₂ represents thenumber of neighbors in class 2 within the defined region.
 2. The systemof claim 1, wherein the defined region within the training set comprisesa sphere ω centered about the test instance, and wherein there are k₁neighbors of class 1 within ω and there are k₂ neighbors in class 2within ω.
 3. The system of claim 2, wherein the size of sphere ω isselected such that probability density for classes 1 and 2 areapproximately constant within sphere ω.
 4. The system of claim 1, wherethe computer system is further configured to compare the estimatedprobabilities for each of the classes to determine if the difference inestimated probability between the class having the highest probabilityestimate and the class having the next highest probability estimate isgreater than a user-supplied parameter.
 5. The system of claim 4,wherein the user-supplied parameter is 0.1.
 6. The system of claim 1,wherein the probabilistic classifier comprises a probabilistic k nearestneighbor classifier.
 7. The system of claim 1, wherein the definedregion comprises a set of k objects within the training set which arethe k closest objects to the test object.
 8. The system of claim 1,wherein the objects comprise the intensities of one or more featuresand/or one or more peaks in mass spectrometry data.
 9. The system ofclaim 8, wherein the objects in the training set comprise test dataobtained from two classes of patients: 1) a first class of patientsexhibiting an adverse health condition and 2) a second class of patientsthat do not exhibit the adverse health condition, and wherein theclasses assigned to the objects correspond to the two classes ofpatients.
 10. The system of claim 8, wherein the objects in the trainingset comprise the data obtained from two classes of patients: 1) a firstclass of patients that derive benefit from a particular therapy fortreatment of a health condition and 2) a second class of patients thateither do not derive benefit, or suffer adverse effects from theparticular therapy for treatment of the medical condition, and whereinthe classes assigned to the objects correspond to the two classes ofpatients.
 11. The system of claim 10, wherein the health conditioncomprises cancer.
 12. The system of claim 11, wherein the cancercomprises non-small cell lung cancer.
 13. A method for classifying atest object, comprising the steps of: accessing a machine-readablestorage device storing a training set comprising a number of objects,each of the objects being assigned as a member of a class, collectivelythe objects in the training set comprising members of at least twoclasses; and estimating the probability of an object as being a memberof each class in the training set, the estimating being performed withreference to the class assignments of the objects in the training setwhich are neighbors to the test object within a defined region withinthe training set, and classifying the test object as belonging to theclass with the highest estimated probability; wherein the training setcomprises objects being members of two classes, class 1 and class 2,wherein classes 1 and 2 have numbers of objects N₁ and N₂, respectively,in the training set, and wherein the probability P(class 1) of the testinstance being a member of Class 1 is estimated according to therelation:${P( {{class}\mspace{14mu} 1} )} = {\frac{k_{1} + 1}{k_{1} + k_{2} + 2} \cdot {{{}_{}^{}{}_{}^{}}( {1,{{k_{2} + 1};{k_{1} + k_{2} + 3};{1 - \frac{N_{1}}{N_{2}}}}} )}}$where ₂F₁(1, k₂+1; k₁+k₂+3; 1−N1/N2) is a calculation of thehypergeometric function ₂F₁ and where k₁ represents the number ofneighbors of class 1 within the defined region and k₂ represents thenumber of neighbors in class 2 within the defined region.
 14. The methodof claim 13, further comprising the step of comparing the estimates ofprobabilities for each of the classes to determine if the difference ofestimated probability between the class having the highest probabilityestimate and the class having the next highest probability estimate isgreater than a user-supplied parameter.
 15. The method of claim 14,wherein the user-supplied parameter is 0.1.
 16. The method of claim 13,wherein the defined region within the training set comprises a sphere ωcentered about the test object, and wherein there are k₁ neighbors ofclass 1 within ω and there are k₂ neighbors in class 2 within ω.
 17. Themethod of claim 16, wherein the size of sphere ω is selected such thatprobability density for classes 1 and 2 are approximately constantwithin sphere ω.
 18. The method of claim 13, wherein the defined regioncomprises a set of k objects within the training set which are the kclosest objects to the test instance.
 19. The method of claim 13,wherein the objects comprise the intensities of one or more featuresand/or one or more peaks in mass spectrometry data.
 20. The method ofclaim 19, wherein the objects in the training set comprise test dataobtained from two classes of patients: 1) a first class of patientsexhibiting an adverse health condition and 2) a second class of patientsthat do not share the adverse health condition, and wherein the classesassigned to the objects correspond to the two classes of patients. 21.The method of claim 19, wherein the objects in the training set comprisethe data obtained from two classes of patients: 1) a first class ofpatients that derive benefit from a particular therapy for treatment ofa health condition and 2) a second class of patients that either do notderive benefit, or suffer adverse effects from the particular therapyfor treatment of the health condition, and wherein the classes assignedto the objects correspond to the two classes of patients.
 22. The methodof claim 21 wherein the health condition comprises cancer.
 23. Themethod of claim 22, wherein the cancer comprises non-small cell lungcancer.
 24. A method of classification of a test instance comprising thesteps of: creating and storing in a machine-readable memory a trainingset comprising a plurality of objects, the objects being assigned aclass label, the objects being members of either class 1 or a class 2;obtaining a test instance to be classified; classifying the testinstance with a computer system configured as a probabilistic classifierby estimating the probability that the test instance is a member ofclasses 1 and 2, wherein the probability P(class 1) of the test instancebeing a member of Class 1 is estimated according to the relation:${P( {{class}\mspace{14mu} 1} )} = {\frac{k_{1} + 1}{k_{1} + k_{2} + 2} \cdot {{{}_{}^{}{}_{}^{}}( {1,{{k_{2} + 1};{k_{1} + k_{2} + 3};{1 - \frac{N_{1}}{N_{2}}}}} )}}$where ₂F₁ (1, k₂+1; k₁+k₂+3; 1−N1/N2) is a calculation of thehypergeometric function ₂F₁ and where k₁ represents the number ofneighbors of class 1 within a defined region in the training set and k₂represents the number of neighbors in class 2 within the defined region,N₁ is the number of objects in class 1 in the training set, and N₂ isthe number of objects in class 2 in the training set.
 25. The method ofclaim 24, further comprising the steps of conducting mass spectroscopyon a test sample, wherein the test instance comprises a data setrepresenting a spectrum obtained from the mass spectroscopy.
 26. Themethod of claim 25, wherein the test sample comprises a sample obtainedfrom a human subject.
 27. The method of claim 24, further comprising thesteps of estimating the probability that the test instance is a memberof classes 1 and 2, and comparing the estimates of probabilities foreach of the classes to determine if the difference of estimatedprobability between the class having the highest probability estimateand the class having the next highest probability estimate is greaterthan a user-supplied parameter.
 28. A system for classification of atest object, comprising: a machine-readable storage device storing atraining set comprising a plurality of objects, each of the objectsbeing assigned as a member of a class, collectively the objects in thetraining set comprising members of at least two classes, including class1 and class 2; and a computer system coupled to the machine-readablestorage device configured as a probabilistic classifier, theprobabilistic classifier estimating the probability of the test objectas being a member of a class in the training set, wherein theprobabilistic classifier estimates the probability with reference to theclass assignments of objects in the training set which are neighbors tothe test object within a defined region within the training set; whereinclasses 1 and 2 have N₁ and N₂ objects, respectively, in the trainingset, wherein N₁ and N₂ are not the same; and wherein there are only twoclasses of objects in the training set, classes 1 and 2, and wherein theprobability P(class 1) of the test instance being a member of Class 1 isestimated according to the relation:${P( {{class}\mspace{14mu} 1} )} = {\frac{k_{1} + 1}{k_{1} + k_{2} + 2} \cdot {{{}_{}^{}{}_{}^{}}( {1,{{k_{2} + 1};{k_{1} + k_{2} + 3};{1 - \frac{N_{1}}{N_{2}}}}} )}}$where ₂F₁ (1, k₂+1; k₁+k₂+3; 1−^(N1)/_(N2)) is a calculation of thehypergeometric function ₂F₁ and where k₁ represents the number ofneighbors of class 1 within a defined region in the training set and k₂represents the number of neighbors in class 2 within the defined region,N₁ is the number of objects in class 1 in the training set, and N₂ isthe number of objects in class 2 in the training set.
 29. The system ofclaim 28, wherein the probabilistic classifier estimates the probabilityof the test object as being a member of each of the classes in thetraining set and classifies the test object as belonging to the classwith the highest estimated probability.
 30. The system of claim 28,wherein the objects in the training set comprise the intensities of oneor more features and/or one or more peaks in mass spectrometry data. 31.The system of claim 30, wherein the objects in the training set comprisetest data obtained from two classes of patients: 1) a first class ofpatients exhibiting an adverse health condition and 2) a second class ofpatients that do not exhibit the adverse health condition, and whereinthe classes assigned to the objects correspond to the two classes ofpatients.
 32. The system of claim 30, wherein the objects in thetraining set comprise the data obtained from two classes of patients: 1)a first class of patients that derive benefit from a particular therapyfor treatment of a health condition and 2) a second class of patientsthat either do not derive benefit, or suffer adverse effects from theparticular therapy for treatment of the medical condition, and whereinthe classes assigned to the objects correspond to the two classes ofpatients.
 33. The system of claim 32, wherein the health conditioncomprises cancer.
 34. The system of claim 33, wherein the cancercomprises non-small cell lung cancer.